首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   57篇
  免费   27篇
  国内免费   1篇
  2024年   2篇
  2023年   1篇
  2022年   1篇
  2021年   1篇
  2020年   2篇
  2019年   2篇
  2017年   2篇
  2016年   2篇
  2015年   2篇
  2014年   6篇
  2013年   2篇
  2012年   1篇
  2011年   9篇
  2010年   5篇
  2009年   5篇
  2008年   1篇
  2007年   3篇
  2006年   6篇
  2005年   4篇
  2004年   2篇
  2003年   3篇
  2002年   2篇
  2001年   4篇
  2000年   4篇
  1999年   1篇
  1998年   3篇
  1996年   1篇
  1995年   1篇
  1993年   1篇
  1992年   1篇
  1991年   1篇
  1990年   4篇
排序方式: 共有85条查询结果,搜索用时 15 毫秒
31.
针对在HBase中如何进行有效的半结构化时空数据存储和查询问题展开研究,对该问题进行形式化描述,并利用半结构化处理方法 TwigStack提出HBase的半结构化时空数据存储模型,在此基础上开展了半结构化的时空范围查询和kNN查询。在真实数据集中进行实验,与需要硬件配置较高的MongoDB进行了对比,结果表明在普通配置的机器上,所提出的半结构化时空查询算法与MongoDB性能相近,在实际中具有优势。  相似文献   
32.
33.
现有山体滑坡雷达是轨道式的,这样就需要精确控制雷达的运动来获得高方位向分辨率,因此,硬件设备要求极高。利用多输入多输出(MIMO)技术通过分时发射和接收信号来获取高方位向分辨率,可以免去雷达运动,从而简化了雷达设备和降低雷达成本。此外,结合步进频连续波技术可以使山体滑坡雷达保持高距离向分辨率的同时进一步降低对硬件的要求,更易于工程实现,成本更低。通过MATLAB仿真初步验证了该方案的可行性。  相似文献   
34.
This article considers the order batching problem in steelmaking and continuous‐casting production. The problem is to jointly specify the slabs needed to satisfy each customer order and group all the slabs of different customer orders into production batches. A novel mixed integer programming model is formulated for the problem. Through relaxing the order assignment constraints, a Lagrangian relaxation model is then obtained. By exploiting the relationship between Lagrangian relaxation and column generation, we develop a combined algorithm that contains nested double loops. At the inner loop, the subgradient method is applied for approximating the Lagrangian dual problem and pricing out columns of the master problem corresponding to the linear dual form of the Lagrangian dual problem. At the outer loop, column generation is employed to solve the master problem exactly and adjust Lagrangian multipliers. Computational experiments are carried out using real data collected from a large steel company, as well as on large‐scaled problem instances randomly generated. The results demonstrate that the combined algorithm can obtain tighter lower bound and higher quality solution within an acceptable computation time as compared to the conventional Lagrangian relaxation algorithm. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011  相似文献   
35.
This article analyses a divergent supply chain consisting of a central warehouse and N nonidentical retailers. The focus is on joint evaluation of inventory replenishment and shipment consolidation effects. A time‐based dispatching and shipment consolidation policy is used at the warehouse in conjunction with real‐time point‐of‐sale data and centralized inventory information. This represents a common situation, for example, in various types of vendor managed inventory systems. The main contribution is the derivation of an exact recursive procedure for determining the expected inventory holding and backorder costs for the system, under the assumption of Poisson demand. Two heuristics for determining near optimal shipment intervals are also presented. The results are applicable both for single‐item and multiitem systems. © 2011 Wiley Periodicals, Inc. Naval Research Logistics 58: 59–71, 2011  相似文献   
36.
We consider a supplier with finite production capacity and stochastic production times. Customers provide advance demand information (ADI) to the supplier by announcing orders ahead of their due dates. However, this information is not perfect, and customers may request an order be fulfilled prior to or later than the expected due date. Customers update the status of their orders, but the time between consecutive updates is random. We formulate the production‐control problem as a continuous‐time Markov decision process and prove there is an optimal state‐dependent base‐stock policy, where the base‐stock levels depend upon the numbers of orders at various stages of update. In addition, we derive results on the sensitivity of the state‐dependent base‐stock levels to the number of orders in each stage of update. In a numerical study, we examine the benefit of ADI, and find that it is most valuable to the supplier when the time between updates is moderate. We also consider the impact of holding and backorder costs, numbers of updates, and the fraction of customers that provide ADI. In addition, we find that while ADI is always beneficial to the supplier, this may not be the case for the customers who provide the ADI. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011  相似文献   
37.
高层建筑数量增多的同时,其人员安全疏散问题日益凸显,研究高层建筑受困人员火灾情况下的自救逃生和连续疏散非常重要。结合国内外高层建筑逃生装置研究现状和存在的主要问题,研究设计了连续不间断高层建筑快速逃生装置的结构,分析了其结构设计特点,并与传统救援设备进行了性能对比分析。针对国内高层建筑火灾形势,探讨了该装置在高层建筑受困人员快速、多人连续逃生方面的优势和应用前景。  相似文献   
38.
为研究不同初始荷载作用下侧贴碳纤维布加固连续梁的受力与变形特性,以及初始荷载对加固效果的影响,对4根钢筋混凝土两跨连续梁(其中1根为未加固连续梁,其余3根为在不同初始荷载下侧贴碳纤维布加固连续梁)进行了试验研究。结果表明:侧贴碳纤维布加固连续梁不仅能提高加固梁的承载力,提高幅度达16%以上;还能提高加固梁的刚度,减少其挠度和裂缝宽度;加固效果受初始荷载影响,初始荷载越小,加固效果越好。  相似文献   
39.
In this paper, we study the on‐line parameter estimation problem for a partially observable system subject to deterioration and random failure. The state of the system evolves according to a continuous time homogeneous Markov process with a finite state space. The system state is not observable, except for the failure state. The information related to the system state is available at discrete times through inspections. A recursive maximum likelihood (RML) algorithm is proposed for the on‐line parameter estimation of the model. The RML algorithm proposed in the paper is considerably faster and easier to apply than other RML algorithms in the literature, because it does not require projection into the constraint domain and calculation of the gradient on the surface of the constraint manifolds. The algorithm is illustrated by an example using real vibration data. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006  相似文献   
40.
本文借助奇异函数,用阶梯函数表示阶梯形梁的抗弯刚度的倒数,在考虑支座沉陷影响的情况下,推导出了阶梯形连续梁在弹性支座支承下的弯曲计算普遍方程,给出了支座反力计算的矩阵方程。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号